Is OSM Good Enough for Vehicle Routing? A Study Comparing Street Networks in Vienna
نویسندگان
چکیده
As a result of OpenStreetMap’s (OSM) openness and wide availability, there is increasing interest in using OSM street network data in routing applications. But due to the heterogeneous nature of Volunteered Geographic Information (VGI) in general and OSM in particular, there is no universally valid answer to questions about the quality of these data sources. In this paper we address the lack of systematic analyses of the quality of the OSM street network for vehicle routing and the effects of using OSM rather than proprietary street networks in vehicle routing applications. We propose a method to evaluate the quality of street networks for vehicle routing purposes which compares relevant street network features as well as computed route lengths and geometries using the Hausdorff distance. The results of our case study comparing OSM and the official Austrian reference graph in the city of Vienna show close agreement of one-way street and turn restriction information. Comparisons of 99,000 route pairs with an average length of 6,812 m show promising results for vehicle routing applications with OSM, especially for route length computation where we found median absolute length differences of 1.0%.
منابع مشابه
A PFIH-Based Heuristic for Green Routing Problem with Hard Time Windows
Transportation sector generates a considerable part of each nation's gross domestic product and considered among the largest consumers of oil products in the world. This paper proposes a heuristic method for the vehicle routing problem with hard time windows while incorporating the costs of fuel, driver, and vehicle. The proposed heuristic uses a novel speed optimization algorithm to reach its ...
متن کاملA Multi-Objective Imperialist Competitive Algorithm for Vehicle Routing Problem in Cross-docking Networks with Time Windows
This study addresses the pickup and delivery problem for cross-docking strategy, in which shipments are allowed to be transferred from suppliers to retailers directly as well as through cross-docks. Usual models that investigate vehicle routing in cross-docking networks force all vehicles to stop at the cross-dock even if a shipment is about to a full truckload or the vehicle collects and deliv...
متن کاملComparing Two-Echelon and Single-Echelon Multi-Objective Capacitated Vehicle Routing Problems
This paper aims to compare a two-echelon and a single-echelon distribution system. A mathematical model for the Single-Echelon Capacitated Vehicle Routing Problem (SE-CVRP) is proposed. This SE-CVRP is the counterpart of Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) introduced in the authors’ previous work. The proposed mathematical model is Mixed-Integer Non-Linear Programming (MIN...
متن کاملA New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks
In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...
متن کاملA new Bi-objective model for a Two-echelon Capacitated Vehicle Routing Problem for Perishable Products with the Environmental Factor
In multi-echelon distribution strategy freight is delivered to customers via intermediate depots. Rather than using direct shipments, this strategy is an increasingly popular one in urban logistics. This is primarily to alleviate the environmental (e.g., energy usage and congestion) and social (e.g., traffic-related air pollution, accidents and noise) consequences of logistics operations. This ...
متن کامل